package cn.wolfcode.luowowo.query;

import lombok.Getter;
import lombok.Setter;

import java.util.HashMap;

@Setter
@Getter
public class TravelCondition {

    public static final HashMap<Integer,TravelCondition> dayMap = new HashMap<>();
    public static final HashMap<Integer,TravelCondition> perExpendMap = new HashMap<>();
    static {
        //出现天数
        dayMap.put(-1, null);
        dayMap.put(1, new TravelCondition(0, 3));
        dayMap.put(2, new TravelCondition(4, 7));
        dayMap.put(3, new TravelCondition(8, 14));
        dayMap.put(4, new TravelCondition(15, Integer.MAX_VALUE));

        //人均消费
        perExpendMap.put(-1, null);
        perExpendMap.put(1, new TravelCondition(1, 999));
        perExpendMap.put(2, new TravelCondition(1000, 6000));
        perExpendMap.put(3, new TravelCondition(6001, 20000));
        perExpendMap.put(4, new TravelCondition(20001, Integer.MAX_VALUE));
    }

    private int min;  //最小
    private int max;  //最大
    public TravelCondition(int min, int max){
        this.min = min;
        this.max = max;
    }


}
